Locating Flow Capturing Facilities on A Railway Network with Two Levels of Coverage
نویسندگان
چکیده
This paper presents a flow capturing location problem which focuses on railway passenger flows. The flow capturing location problem (FCLP), originally proposed by Hodgson (1990), aims to locate a given number of facilities on a network to maximize the total flow that can obtain service at facilities along their pre-planned routes. For railway users, facilities located at the origin station and the destination station are more easily accessible than facilities located midway along the path. Therefore, we differentiate these two cases by introducing two levels of coverage; a given flow is fully captured when captured at the origin station or the destination station, or partially captured when captured at a midway station along the path. We provide an integer programming formulation of the proposed problem. We apply the model to analyze the optimal locations of flow capturing facilities on Keio Line using commuter traffic flow data, which is extracted from transportation census data of Tokyo Metropolitan area.
منابع مشابه
Locations and Service Start Time of Flow-covering Facilities with Multiple Coverage Levels
This paper develops an extended version of MFCLSTP (Maximum Flow-Covering Location and service Start Time Problem, Tanaka 2011) by introducing multiple coverage levels based on the arrival time to a destination. The original MFCLSTP determines the locations of facilities and the start time of services of fixed duration to maximize coverage for flows on the way back home from work. In MFCLSTP, e...
متن کاملGoal Programming Approach to the Bi-Objective Competitive Flow-Capturing Location-Allocation Problem
Majority of models in location literature are based on assumptions such as point demand, absence of competitors, as well as monopoly in location, products, and services. However in real-world applications, these assumptions are not well-matched with reality. In this study, a new mixed integer nonlinear programming model based on weighted goal programming approach is proposed to maximize the c...
متن کاملA mathematical model for finding the optimal locations of railway stations
Regarding the importance of competitive advantages among the transportation systems, improving the costumer’s satisfaction is an important factor in attracting them to these systems. In this research, we focus on the effects of constructing new stations on users and a new mathematical model is proposed for this problem. In the proposed model, two simultaneous effects on customers by constructin...
متن کاملA Benders' Decomposition Method to Solve Stochastic Distribution Network Design Problem with Two Echelons and Inter-Depot Transportation
In many practical distribution networks, managers face significant uncertainties in demand, local price of building facilities, transportation cost, and macro and microeconomic parameters. This paper addresses design of distribution networks in a supply chain system which optimizes the performance of distribution networks subject to required service level. This service level, which is consider...
متن کاملA model for distribution centers location-routing problem on a multimodal transportation network with a meta-heuristic solving approach
Nowadays, organizations have to compete with different competitors in regional, national and international levels, so they have to improve their competition capabilities to survive against competitors. Undertaking activities on a global scale requires a proper distribution system which could take advantages of different transportation modes. Accordingly, the present paper addresses a location-r...
متن کامل